A solution to the unequal area facilities layout problem by genetic algorithm

نویسندگان

  • Ming-Jaan Wang
  • Michael H. Hu
  • Meei-Yuh Ku
چکیده

The majority of the issued facilities layout problems (FLPs) minimize the material handling cost and ignore other factors, such as area utilization, department shape and site shape size. These factors, however, might influence greatly the objective function and should give consideration. The research range of this paper is focus on the unequal areas department facilities layout problem, and implement analysis of variance (ANOVA) of statistics to find out the best site size of layout by genetic algorithm. The proposed module takes the minimum total layout cost (TLC) into account. TLC is an objective function combining material flow factor cost (MFFC), shape ratio factor (SRF) and area utilization factor (AUF). In addition, a rule-based of expert system is implemented to create space-filling curve for connecting each unequal area department to be continuously placed without disjoint (partition). In this manner, there is no gap between each unequal area department. The experimental results show that the proposed approach is more feasible in dealing with the facilities layout problems in the real world. # 2004 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...

متن کامل

A heuristic method for combined optimization of layout design and cluster configuration in continuous productions

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

متن کامل

Stochastic Facility Layout Planning Problem: A Metaheuristic and Case Study

Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....

متن کامل

Applying Genetic Algorithm to Dynamic Layout Problem

In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...

متن کامل

Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers in Industry

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2005